Parametric Comparison of K-means and Adaptive K-means Clustering Performance on Different Images

Image segmentation takes a major role to analyzing the area of interest in image processing. Many researchers have used different types of techniques to analyzing the image. One of the widely used techniques is K-means clustering. In this paper we use two algorithms K-means and the advance of K-means is called as adaptive K-means clustering. Both the algorithms are using in different types of image and got a successful result. By comparing the Time period, PSNR and RMSE value from the result of both algorithms we prove that the Adaptive K-means clustering algorithm gives a best result as compard to K-means clustering in image segmentation.   

Mobile Ad Hoc Networks Authentication Using Npv Method

NPV (Neighbour Position Verification) method is companionable with security architectures counting the ones that have been projected for vehicular networks which symbolize a likely deployment environment for NPV. Such a situation is of particular interest since it leaves the door open for adversarial nodes to misuse or disturb the location-based services. We deal with the open issue by suggesting a completely circulated cooperative solution that is robust against independent and colluding adversaries and can be weaken only by an overwhelming presence of adversaries

To The Encrypted Sensed Data By Applying Digital Signatures To Message Packets Using SET-IBS and SET-IBOOS

We recommend two protected and resourceful data Transmission(SET) protocols for CWSNs, called SET-IBS and SETIBOOS,by means of the IBS scheme and the IBOOS scheme, correspondingly. The key suggestion of both SET-IBS and SET-IBOOS is to confirm the encrypted sensed data, by be valid digital signatures to message packets, which are capable in communication and applying the key supervision for security. In the proposed protocols, secret keys and pairing parameters are scattered and preloaded in all sensor nodes by the BS at first, which overcomes the key escrow difficulty explain in ID-based crypto-systems. Cluster-based data transmission in WSNs has been examined by researchers in order to attain the network scalability and management, which make the most of node life and decrease bandwidth use by using local collaboration in the middle of sensor nodes

A Security Measure That Quantify The Anonymity Of Different Systems

The basis ambiguity difficulty in wireless sensor networks is the trouble of studying methods that provide time and position privacy for events reported by sensor nodes. Time and location privacy will be used interchangeably with source anonymity throughout the paper. The source anonymity problem has been drawing growing research concentration recently the source anonymity problem has been addressed under two different types of adversary’s namely local and global adversaries. A local adversary is definite to be an adversary having limited mobility and inequitable view of the network traffic. Routing based methods have been shown to be efficient in hiding the locations of reported events against local adversaries. A global adversary is defined to be an adversary with capacity to check the traffic of the entire network e.g. coordinating adversaries spatially distributed over the network. Against global adversaries routing based techniques are known to be unproductive in cover up location information in event-triggered transmission

A Fault Localization Algorithm To Isolate Faulty Devices and Rules

Network engineerspursue down bugs by means of the simplest tools and track down root causesusing a grouping of mount upinsight and perception. Debuggingnetworks is only fetching harder as networks are gettingbigger. Moderndata centres may surround 10 000 switches, acampus network may serve 50 000 users, a 100-Gb/s long-haul link may carry 100 000 flows and are getting morethornywith over 6000 RFCs, router software is based on millions oflines of source code, and network chips repeatedly contain billionsof gates. It is a mall conjecture that network engineers have beenlabelled “masters of complexity”

To demonstrate overlay routing using BPG routing, TCP improvement, and VOIP applications

If we are just concerned in getting better routing properties among a single source node and a single destination, then the dilemma is not intricate, and judgment the optimal number of nodes becomes in significant because the probable contender for super impose assignment is diminutive, and in general any obligation would be superior. Nevertheless, when we regard as one-to-many or many-to-many circumstances, then a single overlay node could concern the lane possessions of many paths, and thus decide the best locations turn out to be much less insignificant. We thoroughly learn this optimization problem. We demonstrate that it is NP-hard and get a nontrivial approximation algorithm for it, where the approximation relation depends on exact properties of the difficulty at hand. We look at the sensible feature of the system by assess the increase one can get over some genuine scenarios

Finding Frequent Text-Patterns on Big Data using Visualisation Techniques

Big Data has got more importance in various industries over the last couple of years, which is applied on various huge and large data sets because it cannot be stored and process through traditional databases. Big data has huge potential to store and process such huge and large datasets in several ways because, during processing, we are analyzing the large datasets in required time. Text analysis is still somewhat in its infancy but is very promising. Because in most of the companies 80% of data is in unstructured form, while most types of analysis only work with structured data. In this paper, we are discussing some visualization techniques available for Big data. Finally, R package is used to analyze unstructured text because R is freely available and it comes with lots of free packages and powerful tools through which we can easily analyze the large data sets in a sufficient time

A New Approach for Node Replica Detection in WSN

Wireless sensor networks are a collection of sensor nodes scattered over the area for data collection. But the main problem is it is in danger to the node clone. To identify Node clone proposing  distributed hash table  which a fully decentralized, key-based caching and checking system .next introducing  distributed detection protocol provides  good communication performance for large  sensor networks. sensor-MAC a new MAC protocol explicitly designed for wireless sensor networks for reducing energy consumption. Our protocol also has good scalability and collision avoidance capabilit

Enhanced Protocol for data exchange through Natural Wireless Ad Hoc Networks

This paper presents a secure protocol for spontaneous wireless ad hoc networks which uses a hybrid symmetric/ asymmetric scheme and the trust between users in order to exchange the initial data and to exchange the secret keys that will be used to encrypt the data. Trust is based on the first visual contact between users. Our proposal is a complete self-configured secure protocol that is able to create the network and share secure services without any infrastructure

Method To Prevent Re-Identification Of Individual Nodes By Combining K-Degree Anonymity With L-Diversity

A range of privacy models as well as anonymization algorithms have been developed. In tabular micro data some of the no responsive attributes called quasi identifiers can be used to reidentify individuals and their sensitive attributes. When publishing social network data graph structures are also published with equivalent social relationships. As a result it may be oppressed as a new means to compromise privacy. ITH the rapid growth of social networks such as Face book and LinkedIn more and more researchers establish that it is a great opportunity to get hold of useful information from these social network data such as the user behavior, community growth, disease spreading etc. Though it is supreme that published social network data should not disclose private information of individuals. Therefore how to protect individual’s privacy and at the same time protect the utility of social network data becomes a challenging topic. In this paper we believe a graph model where each highest point in the graph is associated with a sensitive label